On the Deng-Lin random number generators and related methods
نویسندگان
چکیده
We study the structure and point out weaknesses of recently-proposed random number generators based on special types of linear recurrences with small coefficients, which allow fast implementations. Our theoretical analysis is complemented by the results of simple empirical statistical tests that the generators fail decisively. Directions for improvement and alternative generators are also pointed out.
منابع مشابه
Statistical Justification of Combination Generators
The combination generator, first proposed by Wichmann and Hill (1982), is constructed by taking the fractional part of the sum of several random number generators. It is probably one of the most popular random number generators used. Its empirical performance is superior to the classical Lehmer congruential generator. However, its theoretical justification is somewhat primitive. In this paper, ...
متن کاملImproving Random Number Generators in the Monte Carlo simulations via twisting and combining
Problems for various random number generators accompanying the Wolff algorithm [U. Wolff, Phys. Rev. Lett. 62 (1989) 361; U. Wolff, Phys. Lett. B 228 (1989) 379] are discussed, including the hidden errors first reported in [A.M. Ferrenberg, D.P. Landau, Y.J. Wong, Phys. Rev. Lett. 69 (1992) 3382]. A general (though simple) method of twisting and combining for improving the performance of these ...
متن کاملDesign of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کاملDesign of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کاملSome Characterizations of the Uniform Distribution with Applications to Random Number Generation
Let U and V be independent random variables with continuous density function on the interval (0, 1). We describe families of functions g for which uniformity of U and V is equivalent to uniformity of g(U, V) on (0, 1). These results axe used to prescribe methods for improving the quality of pseudo-random number generators by making them closer in distribution to the U(0, 1) distribution.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Statistics and Computing
دوره 14 شماره
صفحات -
تاریخ انتشار 2004